Combining Texts

All the ideas for 'Set Theory', 'Axiomatic Theories of Truth (2005 ver)' and 'Aspects of Scientific Explanation'

expand these ideas     |    start again     |     specify just one area for these texts


25 ideas

3. Truth / A. Truth Problems / 2. Defining Truth
Truth definitions don't produce a good theory, because they go beyond your current language [Halbach]
3. Truth / F. Semantic Truth / 1. Tarski's Truth / c. Meta-language for truth
In semantic theories of truth, the predicate is in an object-language, and the definition in a metalanguage [Halbach]
3. Truth / G. Axiomatic Truth / 1. Axiomatic Truth
Instead of a truth definition, add a primitive truth predicate, and axioms for how it works [Halbach]
Should axiomatic truth be 'conservative' - not proving anything apart from implications of the axioms? [Halbach]
If truth is defined it can be eliminated, whereas axiomatic truth has various commitments [Halbach]
Axiomatic theories of truth need a weak logical framework, and not a strong metatheory [Halbach]
3. Truth / H. Deflationary Truth / 2. Deflationary Truth
Deflationists say truth merely serves to express infinite conjunctions [Halbach]
4. Formal Logic / F. Set Theory ST / 1. Set Theory
To prove the consistency of set theory, we must go beyond set theory [Halbach]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / b. Axiom of Extensionality I
Extensionality: ∀x ∀y (∀z (z ∈ x ↔ z ∈ y) → x = y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / c. Axiom of Pairing II
Pairing: ∀x ∀y ∃z (x ∈ z ∧ y ∈ z) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / d. Axiom of Unions III
Union: ∀F ∃A ∀Y ∀x (x ∈ Y ∧ Y ∈ F → x ∈ A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / f. Axiom of Infinity V
Infinity: ∃x (0 ∈ x ∧ ∀y ∈ x (S(y) ∈ x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / g. Axiom of Powers VI
Power Set: ∀x ∃y ∀z(z ⊂ x → z ∈ y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / h. Axiom of Replacement VII
Replacement: ∀x∈A ∃!y φ(x,y) → ∃Y ∀X∈A ∃y∈Y φ(x,y) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / i. Axiom of Foundation VIII
Foundation:∀x(∃y(y∈x) → ∃y(y∈x ∧ ¬∃z(z∈x ∧ z∈y))) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / j. Axiom of Choice IX
Choice: ∀A ∃R (R well-orders A) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / k. Axiom of Existence
Set Existence: ∃x (x = x) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / n. Axiom of Comprehension
Comprehension: ∃y ∀x (x ∈ y ↔ x ∈ z ∧ φ) [Kunen]
4. Formal Logic / F. Set Theory ST / 4. Axioms for Sets / o. Axiom of Constructibility V = L
Constructibility: V = L (all sets are constructible) [Kunen]
5. Theory of Logic / C. Ontology of Logic / 1. Ontology of Logic
We can use truth instead of ontologically loaded second-order comprehension assumptions about properties [Halbach]
5. Theory of Logic / E. Structures of Logic / 7. Predicates in Logic
Instead of saying x has a property, we can say a formula is true of x - as long as we have 'true' [Halbach]
14. Science / A. Basis of Science / 4. Prediction
Explanatory facts also predict, and predictive facts also explain [Hempel, by Okasha]
14. Science / D. Explanation / 2. Types of Explanation / e. Lawlike explanations
For Hempel, explanations are deductive-nomological or probabilistic-statistical [Hempel, by Bird]
The covering-law model is for scientific explanation; historical explanation is quite different [Hempel]
14. Science / D. Explanation / 2. Types of Explanation / g. Causal explanations
Hempel rejects causation as part of explanation [Hempel, by Salmon]